# Coding Interview Question: Inorder Traversal

Coding Interview Question: Given a binary search tree, print out the elements of the tree in order without using recursion. Click for the solution.

Coding Interview Question: Given a binary search tree, print out the elements of the tree in order without using recursion. Click for the solution.

Coding Interview Question: Write an autocomplete class that returns all dictionary words with a given prefix. Click for the solution.

Coding Interview Question: Implement a binary tree with a method getRandomNode() that returns a random node. Click for the solution.

Coding Interview Question: Given two nodes in a binary tree, write a function to find the lowest common ancestor. Click for the solution.

Coding Interview Question: Given a tree, convert it into a doubly linked list from left to right by modifying the existing pointers. Click for the solution.

Coding Interview Question: Given a tree, find the length of the longest branch of nodes in increasing consecutive order. Click for the solution.

Coding Interview Question: Given a binary tree, write a function to determine whether the tree is balanced. Click for the solution.

Coding Interview Question: Given a tree, write a function that prints out the nodes of the tree in level order. Click for the solution.

Coding Interview Question: Given a binary tree, write a function to test if the tree is a binary search tree. Click for the solution.