Skip to content

DevBuilders/tree_exercise

Folders and files

NameName
Last commit message
Last commit date

Latest commit

c601db6 · May 4, 2018

History

3 Commits
May 4, 2018
May 3, 2018
May 4, 2018
May 3, 2018
May 3, 2018

Repository files navigation

Binary Trees

This, week, we'll be looking at trees.

Here are the readings:

The coding exercise this week is to implement a binary tree, depth first search, and in order traversal. You'll need to:

  • Fork this repo (if you need help, ask). This will help me easily see everyone's code
  • Implement insert to add a number the binary tree in the correct position
  • Implement depthFirstSearch
  • Implement inOrderTraversal
  • For extra credit, implement BinaryTree as a generic, e. g. BinaryTree<Int> or BinaryTree<String>

While it is true that none of the test actually force you to create a real BinaryTree, please do :)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages