Midterm Exam Solutions 2017

First-page document preview for Midterm Exam Solutions 2017 in COMS W3134: Data Structures In Java at Columbia University. Inspect the first page below or request the complete PDF study document for free.

Independent study archive Learn more

Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.

📄 Page 1 Preview
First page preview of Midterm Exam Solutions 2017 for Data Structures In Java at Columbia University

Page 1 Key Topics & Excerpt

🔍 Text Transcript

First page excerpt for quick study reference. Complete formulas, diagrams, and subsequent pages are available in the full document.

PwnHero 1. - Base Case A full binary tree with 1 node: Node / \ Null Null has two null links (1+1 = 2) - Assume that a binary tree with N nodes where N ranges from 1 to k, has N+1 NULL child pointers - If we increase the number of nodes from k to k+1, we will be adding a new node in place…

Related COMS Courses at Columbia University