brightlightkim

Given a binary tree, design an algorithm that creates a linked list of all the nodes at each depth (e.g., if you have a tree with depth D, you'll have D linked lists). void createLevelLinkedList(TreeNode root, ArrayList lists, int level){ if (root == null) return; //base case LinkedList list = null; if (lists.size() == level) { list = new LinkedList(); /** * Levels are always traversed in order...

In Order: visit the left branch, then the current node, and finally visit the right branch. When performed on a binary search tree, it visits the nodes in ascending order (hence the name "in-order") void inOrderTraversal(Node node) { if (node != null){ inOrderTraversal(node.left); visit(node); inOrderTraversal(node.right); } } Pre Order: visits the current node before its child nodes (hence the ..

A Tree is a recursive explanation. A tree is a data structure composed of nodes. Each tree has a root node. (Actually, this isn't strictly necessary in graph theory, but it's usually how we use trees in programming, and especially programming interviews) The root node has zero or more child nodes Each child node has zero or more child nodes, and so on. The tree cannot contain cycles. The nodes m..