eubinecto/algodata

I aim to kill 🐤🐤 with 🪨

🪨	🗓	🐤 do more with fewer weights?	🐤 solves a problem that matters at scale?
The Wisdomify Project	2021-now	Draws inductive biases from how we interpret Korean proverbs	A solution to a Tip-of-the-Tongue problem
The Idiomify Project	2022-now	Draws inductive biases from the science of idiom acquisition (The Idiombeddings Project)	A solution to the lack of idiomatic fluency of English-as-a-Foreign-Language writers
The Politely Project	2022-now	N/A, as it is currently rule-based.	A solution to ...

algodata's Issues

chapter 8: Trees: Projects

Trees - TOC

• Trees
  • General Trees
  • Binary Trees
  • Implementing Trees
  • Tree Traversal Algorithm
  • Case Study: An Expression Tree
  • Exercises

Exercises의 프로젝트부터 먼저 보고, top-down 식으로 접근하기.
책을 보고 나서 먼저 이해하고, 책의 도움 없이 직접 다 파이썬으로 코딩해보기.

Goal

일단 시작은 아래 두개 프로젝트를 해보기.

Project: P-8.65

Implement the tree ADT using a linked structure as described in Section
8.3.3. Provide a reasonable set of update methods for your tree.

linked structure로 책에 먼저나오니까. 이것부터 먼저 구현해보기. 그러고나서 시간이 남으면 array indexing으로 구현해보기.

Project: P-8.64

Implement the binary tree ADT using the array-based representation described in Section 8.3.2.

Stack & Queue 구현 & 테스트 작성하기 (python3.8)

why does PyCharm complain about this?

algodata/ch8/eubin/trees.py

Line 88 in 1209783

class BinaryTree(Tree):

이미 ArrayBinaryTree와 LinkedBinaryTree에서 모든 메소드를 implement하는데 왜 저기서 구현을 해야한다고 워닝을 하는지?

Stack & queue 구현 & 테스트 작성하기 (java 15)

• public interface Stack
• Array implementation of the stack: ArrayStack
• LinkedList implementation of the stack: LinkedListStack
• write simple tests for the two implementations

Stack & queue 간단한 문제 하나 씩 풀기 (Java & python)