2013Apress eBooksRequires access

Introduction to Binary Trees

Noel Kalicharan

Open publisher page 1 citations

Abstract

In this chapter, we will explain the following: The difference between a tree and a binary tree How to perform pre-order, in-order, and post-order traversals of a binary tree How to represent a binary tree in a computer program How to build a binary tree from given data What a binary search tree is and how to build one How to write a program to do a word-frequency count of words in a passage How to use an array as a binary tree representation How to write some recursive functions to obtain information about a binary tree How to delete a node from a binary search tree These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

About this research paper

What this paper is about

In this chapter, we will explain the following: The difference between a tree and a binary tree How to perform pre-order, in-order, and post-order traversals of a binary tree How to represent a binary tree in a computer program How to build a binary tree from given data What a binary search tree is and how to build one How to write a program to do a word-frequency count of words in a passage How to use an array as a binary tree representation How to write some recursive functions to obtain information about a binary tree How to delete a node from a binary search tree These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this chapter, we will explain the following: The difference between a tree and a binary tree How to perform pre-order, in-order, and post-order traversals of a binary tree How to represent a binary tree in a computer program How to build a binary tree from given data What a binary search tree is and how to build one How to write a program to do a word-frequency count of words in a passage How to use an array as a binary tree representation How to write some recursive functions to obtain information about a binary tree How to delete a node from a binary search tree These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Key concepts: Computer science, Binary number, Mathematics, Arithmetic

Related papers

Back to paper searchBrowse research topicsOriginal source
Introduction to Binary Trees — Research Paper | ScholarLens